On block Gaussian sketching for the Kaczmarz method
نویسندگان
چکیده
منابع مشابه
Randomized Block Kaczmarz Method with Projection for Solving Least Squares
The Kaczmarz method is an iterative method for solving overcomplete linear systems of equations Ax = b. The randomized version of the Kaczmarz method put forth by Strohmer and Vershynin iteratively projects onto a randomly chosen solution space given by a single row of the matrix A and converges exponentially in expectation to the solution of a consistent system. In this paper we analyze two bl...
متن کاملComments on the randomized Kaczmarz method
In this short note we respond to some concerns raised by Y. Censor, G. Herman, and M. Jiang about the randomized Kaczmarz method that we proposed in [5]. The Kaczmarz method is a well-known iterative algorithm for solving a linear system of equations Ax = b. For more than seven decades, this method was useful in practical applications, and it was studied in many research papers. Despite of this...
متن کاملRandomized Sparse Block Kaczmarz as Randomized Dual Block-Coordinate Descent
We show that the Sparse Kaczmarz method is a particular instance of the coordinate gradient method applied to an unconstrained dual problem corresponding to a regularized `1-minimization problem subject to linear constraints. Based on this observation and recent theoretical work concerning the convergence analysis and corresponding convergence rates for the randomized block coordinate gradient ...
متن کاملThe Randomized Kaczmarz Method with Mismatched Adjoint
This paper investigates the randomized version of the Kaczmarz method to solve linear systems in the case where the adjoint of the system matrix is not exact—a situation we refer to as “mismatched adjoint”. We show that the method may still converge both in the overand underdetermined consistent case under appropriate conditions, and we calculate the expected asymptotic rate of linear convergen...
متن کاملConvergence of the randomized Kaczmarz method for phase retrieval
The classical Kaczmarz iteration and its randomized variants are popular tools for fast inversion of linear overdetermined systems. This method extends naturally to the setting of the phase retrieval problem via substituting at each iteration the phase of any measurement of the available approximate solution for the unknown phase of the measurement of the true solution. Despite the simplicity o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerical Algorithms
سال: 2020
ISSN: 1017-1398,1572-9265
DOI: 10.1007/s11075-020-00895-9